Enhancement over the Variant of Public Key Cryptography (PKC) Algorithm
نویسندگان
چکیده
In this paper, we have shown the development of a new public key cryptosystem which is the extension of the work of “Improvement over three prime RSA with two private keys and one public key”. In many cases, the decryption generation speed is required to be enhanced,e.g; in banking sector, signature generation in one day can be in a large volume as compared to only single signature verification in a day at the destination side.So,the main aim of this paper is to improve the cost of decryption generation. There are already various methods which have been developed to reduce the decryption time such as CRTRSA,Batch RSA,Re-balanced RSA,Multi Prime RSA,RPrime RSA,etc.We have tried the improvement over Multi Prime RSA to increase the decryption generation performance. Our proposed work has been implemented by using JDK1.6 as the programming environment. As compared to Multi Prime RSA, our new approach is much faster and secure. We have also shown the graphical comparison of our new approach with Multi Prime RSA in
منابع مشابه
Fault injection's sensitivity of the McEliece PKC
The McEliece public key cryptosystem (PKC) is supposed secure in a post quantum world [2] because there is no e cient quantum algorithm for the underlying problems, which this cryptosystem is built upon. The purpose of this article is to describe in what the structure of the McEliece PKC is sensitive to fault injection. We present the injection fault in the McEliece scheme using Goppa codes and...
متن کاملAn efficient certificateless signcryption scheme in the standard model
Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...
متن کاملToward an energy efficient PKC-based key management system for wireless sensor networks
Due to wireless nature and hostile environment, providing of security is a critical and vital task in wireless sensor networks (WSNs). It is known that key management is an integral part of a secure network. Unfortunately, in most of the previous methods, security is compromised in favor of reducing energy consumption. Consequently, they lack perfect resilience and are not fit for applications ...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملPKC-PC: A Variant of the McEliece Public Key Cryptosystem based on Polar Codes
Polar codes are novel and efficient error correcting codes with low encoding and decoding complexities. These codes have a channel dependent generator matrix which is determined by the code dimension, code length and transmission channel parameters. This paper studies a variant of the McEliece public key cryptosystem based on polar codes, called"PKC-PC". Due to the fact that the structure of po...
متن کامل